Categorical semantics of a simple differential programming language
نویسندگان
چکیده
منابع مشابه
A categorical programming language
A theory of data types and a programming language based on category theory are presented. Data types play a crucial role in programming. They enable us to write programs easily and elegantly. Various programming languages have been developed, each of which may use different kinds of data types. Therefore, it becomes important to organize data types systematically so that we can understand the r...
متن کاملA Truly Concurrent Semantics for a Simple Parallel Programming Language
This paper gives the first truly concurrent denotational, i.e., compositional semantics for a simple, deterministic parallel language. By truly concurrent we mean the denotational model does not rely on an interleaving of concurrent actions for its definition. Thus, our semantics does not reduce parallelism to nondeterminism, as is done in the more established approaches to concurrency. We also...
متن کاملCategorical Semantics for a Quantum Language∗
We prove a correspondence theorem for a quantum programming language in an axiomatic (categorical) setting. We present a simple whilebased programming language for a machine that has access to Quantum Systems (in particular a system of qubits) and the relevant operations on them. We give (coinciding) operational and denotational semantics for this language at a concrete level (Hilbert spaces an...
متن کاملThe Semantics of Simple Language for Parallel Programming
In this paper, we describe a simple language for parallel programming. Its semantics is studied thoroughly. The desirable properties of this language and its deficiencies are exhibited by this theoretical study. Basic results on parallel program schemata are given. We hope in this way to make a case for more formal (i.e. mathematical) approach to the design of languages for systems programming ...
متن کاملCategorical semantics of programming languages (in COQ)
Formalized mathematics have met an increasing interest in the last years. They give a way to build digital searchable libraries of mathematics, and computerverified proofs allow for a level of trust in the theory which the pen and paper versions cannot supply. Our first goal is to build a library of category theory [2] in the proof assistent COQ [1]. A comprehensive library surely demands more ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2021
ISSN: 2075-2180
DOI: 10.4204/eptcs.333.20